Loop Rerolling for Hardware Decompilation
نویسندگان
چکیده
We introduce the new problem of hardware decompilation . Analogous to software decompilation, is about analyzing a low-level artifact—in this case netlist , i.e., graph wires and logical gates representing digital circuit—in order recover higher-level programming abstractions, using those abstractions generate code written in description language (HDL). The overall requires number pieces. In paper we focus on one specific piece puzzle: technique call loop rerolling Hardware leverages clone detection program synthesis techniques identify repeated logic netlists (such as would be synthesized from loops original HDL code) reroll them into syntactic recovered code. evaluate for over set design benchmarks PyRTL industry standard SystemVerilog. Our implementation identifies rerolls 52 out 53 our benchmark suite, show three examples how can provide concrete benefits: transpilation between HDLs, faster simulation times (with mean speedup 6x), artifact compaction (39% smaller average).
منابع مشابه
A Methodology for Decompilation
A proposed methodology for decompilation of binary programs is presented, along with a description of a particular implementation of this methodology, dcc. dcc is a decompiler for the Intel 80x86 architecture, which takes as input a binary program from a DOS environment and produces C programs as output. The decompiler has been divided into three separate modules which resemble the structure of...
متن کاملHardware in Loop of a Generalized Predictive Controller for a Micro Grid DC System of Renewable Energy Sources
In this paper, a hardware in the loop simulation (HIL) is presented. This application is purposed as the first step before a real implementation of a Generalized Predictive Control (GPC) on a micro-grid system located at the Military University Campus in Cajica, Colombia. The designed GPC, looks for keep the battery bank State of Charge (SOC) over the 70% and under the 90%, what ensures the bes...
متن کاملA Structuring Algorithm for Decompilation
This paper presents a structuring algorithm for arbitrary reducible, unstructured graphs. Graphs are structured into semantically equivalent graphs, without the need of code replication or introduction of new variables. The algorithm makes use of structures such as, if..then..elses, while, repeat and loop loops, and case statements. Gotos are only used when the graph cannot be structured with a...
متن کاملInterprocedural data flow decompilation
Traditional compiler data ow analysis techniques are used to transform the intermediate representation of a decompiled program to a higher representation that eliminates low-level concepts such as registers and condition codes, and reintroduces the high-level concept of expression. Summary data ow information is collected on condition codes and registers, and is propagated across basic blocks a...
متن کاملRobust Controller Design Based-on Aerodynamic Load Simulator Identification Driven by PMSM for Hardware-in-the-Loop Simulations
Aerodynamic load simulators generate the required time varying load to test the actuator’s performance in the laboratory. Electric Load Simulator (ELS) as one of variety of the dynamic load simulators should follows the rotation of the Under Test Actuator (UTA) and applies the desired torque to UTA’s rotor at the same time. In such a situation, a very large torque is imposed to the ELS from the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on programming languages
سال: 2023
ISSN: ['2475-1421']
DOI: https://doi.org/10.1145/3591237